The Logic of Conditional Negation

نویسنده

  • John Cantwell
چکیده

It is argued that the ‘inner’ negation ∼ familiar from 3-valued logic can be interpreted as a form of ‘conditional’ negation: ∼A is read “A is false if it has a truth value”. It is argued that this reading squares well with a particular 3-valued interpretation of a conditional that in the literature has been seen as a serious candidate for capturing the truth conditions of the natural language indicative conditional (e.g. “If Jim went to the party he had a good time”). It is shown that the logic induced by the semantics shares many familiar properties with classical negation, but is orthogonal to both intuitionistic and classical negation: it differs from both in validating the inference from A→ ∼B to ∼(A→ B).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Critical Examination of Ibn-Sina’s Theory of the Conditional Syllogism

This paper will examine Ibn Sina’s theory of the Conditional Syllogism from a purely logical point of view, and will lay bare the principles he adopted for founding his theory, and the reason why the newly introduced part of his logic remained undeveloped and eventually was removed from the texts of logic in the later Islamic tradition. As a preliminary discussion, this paper briefly examines I...

متن کامل

Negation Without Negation in Probabilistic Logic Programming

Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...

متن کامل

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Negation in Logic Programming: A Formalization in Constructive Logic

The conventional formalization of logic programming in classical logic explains very convincingly the basic principles of this programming style. However, it gives no easy or intuitive explanations for the treatment of negation. Logic Programming handles negation through the so-called ^Negation as Failure" inference principle which is rather unconventional from the viewpoint of classical logic....

متن کامل

The Weakest Logic of Conditional Negation

having all the rules of Hilbert’s positive logic (cf. for example [3, p. 98]), the connective of negation ¬ is said to be conditional iff ` ⊆ |=M, where |=M is the consequence relation determined on L by a model M =< I,≤, φ, A > (with a nonempty partially ordered set < I,≤>, a valuation φ ⊆ I × V , V is the set of propositional variables, and A ⊆ I, ∅ 6= A 6= I) in the standard way: for any X ⊆...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Notre Dame Journal of Formal Logic

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2008